Efficient optical implementation of the Bernstein-Vazirani algorithm
نویسندگان
چکیده
P. Londero, C. Dorrer, M. Anderson, S. Wallentowitz, K. Banaszek, and I. A. Walmsley* Clarendon Laboratory, University of Oxford, Oxford OX1 3PU, United Kingdom Bell Laboratories, Lucent Technologies, 101 Crawfords Corner Road, Holmdel, New Jersey 07733, USA Physics Department, San Diego State University, 5500 Campanile Drive, San Diego, California 92182-1233, USA Fachbereich Physik, Universität Rostock, Universitätsplatz 3, D-18051 Rostock, Germany ~Received 24 January 2003; published 9 January 2004!
منابع مشابه
Fiber-optics implementation of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms with three qubits.
We report on a fiber-optics implementation of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms for 8-point functions. The measured visibility of the 8-path interferometer is about 97.5%. Potential applications of our setup to quantum communication or cryptographic protocols using several qubits are discussed.
متن کاملQuantum algorithms for testing Boolean functions
We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same...
متن کاملImplementation of the Deutsch-Jozsa algorithm with Josephson charge qubits
We investigate the realization of a simple solid-state quantum computer by implementing the Deutsch-Jozsa algorithm in a system of Josephson charge qubits. Starting from a procedure to carry out the onequbit Deutsch-Jozsa algorithm we show how the N-qubit version of the Bernstein-Vazirani algorithm can be realized. For the implementation of the three-qubit Deutsch-Jozsa algorithm we study in de...
متن کاملA New Iterative Method For Solving Fuzzy Integral Equations
In the present work, by applying known Bernstein polynomials and their advantageous properties, we establish an efficient iterative algorithm to approximate the numerical solution of fuzzy Fredholm integral equations of the second kind. The convergence of the proposed method is given and the numerical examples illustrate that the proposed iterative algorithm are valid.
متن کاملQuantum lower bound for recursive fourier sampling
We revisit the oft-neglected ‘recursive Fourier sampling’ (RFS) problem, introduced by Bernstein and Vazirani to prove an oracle separation between BPP and BQP. We show that the known quantum algorithm for RFS is essentially optimal, despite its seemingly wasteful need to uncompute information. This implies that, to place BQP outside of PH [log] relative to an oracle, one needs to go outside th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004